Solving Maxwell equations in 3D prismatic domains
نویسندگان
چکیده
منابع مشابه
Solving Maxwell equations in 3D prismatic domains
In this Note, we introduce the Fourier Singular Complement Method, for solving Maxwell equations in a 3D prismatic domain. The numerical implementation of this method provides a continuous approximation of the electromagnetic field. It can be applied to the computation of propagating and evanescent modes in prismatic stub filters, thus generalizing 2D approaches. To cite this article: P. Ciarle...
متن کاملContinuous Galerkin methods for solving the time-dependent Maxwell equations in 3D geometries
A few years ago, Costabel and Dauge proposed a variational setting, which allows one to solve numerically the time-harmonic Maxwell equations in 3D geometries with the help of a continuous approximation of the electromagnetic field. In this paper, we investigate how their framework can be adapted to compute the solution to the time-dependent Maxwell equations. In addition, we propose some exten...
متن کاملWeighted regularization of Maxwell equations in polyhedral domains
We present a new method of regularizing time harmonic Maxwell equations by a divergence part adapted to the geometry of the domain. This method applies to polygonal domains in two dimensions as well as to polyhedral domains in three dimensions. In the presence of reentrant corners or edges, the usual regularization is known to produce wrong solutions due the non-density of smooth fields in the ...
متن کاملNew numerical methods for solving the time-dependent Maxwell equations
We review some recent developments in numerical algorithms to solve the time-dependent Maxwell equations for systems with spatially varying permittivity and permeability. We show that the Suzuki product-formula approach can be used to construct a family of unconditionally stable algorithms, the conventional Yee algorithm, and two new variants of the Yee algorithm that do not require the use of ...
متن کاملSolving Analytic Differential Equations in Polynomial Time over Unbounded Domains
In this paper we consider the computational complexity of solving initial-value problems defined with analytic ordinary differential equations (ODEs) over unbounded domains of R and C, under the Computable Analysis setting. We show that the solution can be computed in polynomial time over its maximal interval of definition, provided it satisfies a very generous bound on its growth, and that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Comptes Rendus Mathematique
سال: 2004
ISSN: 1631-073X
DOI: 10.1016/j.crma.2004.09.032